<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    131. Palindrome Partitioning
   </h1>
   <p>
    Given a string
    <em>
     s
    </em>
    , partition
    <em>
     s
    </em>
    such that every substring of the partition is a palindrome.
   </p>
   <p>
    Return all possible palindrome partitioning of
    <em>
     s
    </em>
    .
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <pre>
<strong>Input:</strong>&nbsp;"aab"
<strong>Output:</strong>
[
  ["aa","b"],
  ["a","a","b"]
]
</pre>
  </div>
  <div>
   <h1 class="question_title">
    131. 分割回文串
   </h1>
   <p>
    给定一个字符串
    <em>
     s
    </em>
    ，将
    <em>
     s
    </em>
    分割成一些子串，使每个子串都是回文串。
   </p>
   <p>
    返回
    <em>
     s
    </em>
    所有可能的分割方案。
   </p>
   <p>
    <strong>
     示例:
    </strong>
   </p>
   <pre><strong>输入:</strong>&nbsp;"aab"
<strong>输出:</strong>
[
  ["aa","b"],
  ["a","a","b"]
]</pre>
  </div>
 </body>
</html>